全文获取类型
收费全文 | 537篇 |
免费 | 121篇 |
国内免费 | 20篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 7篇 |
2020年 | 1篇 |
2019年 | 14篇 |
2018年 | 10篇 |
2017年 | 25篇 |
2016年 | 39篇 |
2015年 | 26篇 |
2014年 | 36篇 |
2013年 | 87篇 |
2012年 | 32篇 |
2011年 | 42篇 |
2010年 | 32篇 |
2009年 | 29篇 |
2008年 | 29篇 |
2007年 | 45篇 |
2006年 | 33篇 |
2005年 | 28篇 |
2004年 | 24篇 |
2003年 | 15篇 |
2002年 | 25篇 |
2001年 | 21篇 |
2000年 | 22篇 |
1999年 | 11篇 |
1998年 | 13篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有678条查询结果,搜索用时 343 毫秒
1.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
2.
An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression 下载免费PDF全文
Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA. 相似文献
3.
Fernando M. M. Ruiz Florent Hainaut Nathalie Schiffino 《Defence and Peace Economics》2016,27(6):774-793
Lobbyists may not share the same interests, but they usually agree to form a link in a network which could eventually be used to spread information, to search for potential partners, to speak with one voice to decision makers. In other words, social links represent value for lobbyists because they may ultimately facilitate access. In this article, we explore the network of the Security and Defense lobbies in the EU and we describe its structure. 相似文献
4.
针对机载航电系统自身辐射源特性,提出一种不依赖敌方探测设备的机载航电系统射频隐身性能评估方法。分析机载航电系统设备在极化域、波形域、能量域中影响射频隐身性能的因素,构建极化域、能量域、波形域射频隐身指标,打破常规的"辐射-接收"模型的隐身性能评估方法,建立基于机载航电系统自身辐射信号工作状态和工作参数的射频隐身定量评估方法。对机载雷达系统进行仿真评估,结果表明,该评估方法能正确反映机载雷达系统的射频隐身性能。 相似文献
5.
C2关系网络演化生成特性分析* 总被引:1,自引:0,他引:1
在网络中心作战背景下,为了探索"聚力前沿"(Power to the Edge)现实要求下的指挥控制(C2)关系动态演化规律,讨论了两种实元的加入策略模型:"信息最优加入"策略(BIMS)和"随机加入"策略(RMS):提出了信息资源利用率、信息资源命中率、信息传输有效率等三个指挥控制关系网络效能指标和一种加权评价方法.通过对仿真结果的分析,发现了BIMS策略下C2关系网络演化过程中存在的自组织、自适应现象,得出了BIMS策略下C2关系网络将具有无尺度网络特征这一结论.最后,比较了BIMS策略和RMS策略下的C2关系网效能和抗随机干扰能力,发现前者优于后者,而且BIMS策略下C2关系网具有逐渐优化的能力. 相似文献
6.
概念层次网络中对偶性设计 总被引:1,自引:0,他引:1
首先对概念层次网络(HNC)理论作简要说明,然后根据HNC中层符号个性化设计理论给出对偶性设计方案,和偶性的具体表现,并给出对偶性概念具体表现的注解。 相似文献
7.
8.
研究和设计了一种高度结构化的神经网络模型HSNN,它能方便地对结构化知识进行表示和处理。文中给出了HSNN的设计过程,并讨论了HSNN在继承、非单调推理和信息检索等方面的应用 相似文献
9.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
10.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献